客户机／服务器计算环境

本文介绍了客户机／服务器计算环境的基本概念和产生背景，阐述了客户机／服务器计算中操作系统的选择原则及企业级客户机／服务器计算环境的特点。     

中国爆破安全网

中国爆破安全网是由中国工程爆破协会主办的涉爆行业信息专业网 ,开通于 2 0 0 3年 4月。该网是民爆器材生产流通主管部门、使用部门和公安机关实施联网监控和规范化管理的有力工具 ,最主要的功能是为涉爆行业管理部门和从业单位提供一个功能完善的管理和办公平台。该网的开通 ,有利于民爆器材生产、销售、购买、使用流向监控制度的贯彻实行。文章介绍了网络的组成、建设原则 ,并给出了中国爆破安全网网络拓扑图     

Development,construction, and use of pneumometric tubes for measurement of steam flow in the steam lines of PVG-1000 at NPP

A system for the direct measurement of steam flow in steam lines after a steam generator, which utilizes a special design of pneumometric tubes and a computing unit that accounts for variation in steam pressure, has been developed to improve the quality of water-level regulation in the steam generators of VVéR-1000 power-generating units in the stationary and transitional modes. The advantage of the pneumometric tubes consists in their structural simplicity, high erosion resistance, and absence of irrevocable losses during measurement of steam flow. A similar measurement system is used at foreign NPP. The measurement system in question has been placed in experimental service at the No. 3 unit of the Balakovo NPP, and has demonstrated its worthiness. This measurement system can also be used to determine steam flow in the steam lines of NPP units with VVéR-1000 and VVéR-440 reactors, and PBMK-1000 power-generating units. __________ Translated from élektricheskie Stantsii, No. 3, March 2007, pp. 23–26.     

基于集群计算机的保护定值在线校核

采用分布式计算技术，研究并实现了基于集群计算机的保护定值在线校核并行计算方法。首先分析了保护定值校核计算的计算量和计算特点，接着对可能采用的并行计算方法进行比较，最后选择了基于电网分块的并行计算方法。采用协调机加计算子机的计算模式，在协调机上执行分块算法，通过基于主导节点的图划分方法把电网分成几块，每台计算子机只校核1块电网内的保护定值，最后由协调机收集汇总计算结果。现场应用证明，该并行计算方法正确、有效。     

Interactive key frame selection model

Video summarization can provide a fine representation of the content of video stream and reduce a large amount of data involved in video indexing, browsing, and retrieval. Moreover, Key frame selection is an important step in the research of content-based video analysis and retrieval. Although there exist a variety of methods for key frame selection, they are heuristic and closed systems, which cannot dynamically generate video summary with user’s preference. In this paper, an M-estimator and epipolar line distance constraint camera motion estimation algorithm is introduced as camera parameters is an important motion feature for key frame selection, and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is applied to optimize estimated parameters. Moreover, since Interactive Computing is a novel-computing model that represents the transition of algorithm to interaction, an interactive model of key frame selection (IKFS) is presented as a result of improving the model of key frame selection (KFS). The model of KFS and IKFS are proved to satisfy the criterion of induction and coinduction, respectively. Experimental results show that the processing scheme generates flexible and desirable summarizations whose distortion rate is lower than current method. Above all, IKFS is an extension to KFS.     

Protecting mobile agents＇ data using trusted computing technology

Even with attractive computational advantages, mobile agent technology has not developed its full potential due to various security issues. This paper proposes a method called Private Key Consignment to solve the problem of how to protect the data carried by mobile agents. It exploits new functionalities and mechanism provided by the trusted computing technology, and adopts both public key and symmetric key cryptographic means for data and key protection. The most notable feature of this method is that it protects the private key of the agent by consigning it to a tamper proof hardware, thus, enabling convenient and secure use of the private key. It provides a new scheme of mobile agents＇ data protection.     

Using Automated Negotiation for Grid Services

The popularity of grid services has widened their application to numerous domains and increased the utilization of computational resources. In order to create more incentives for the resources owners to lease their resources and prevent users from wasting the resources, the introduction of a market-oriented grid is inevitable. However, the issues for the negotiation between service provider and consumer over the supply and demand of resources can be complex, with highly interdependent issues. In this research, a simulated automated negotiation mechanism including a co-evolutionary mechanism and a modified game theory approach is proposed, to assist them in reaching an agreement over the conflicting issues. In the proposed architecture, the co-evolution process is able to reduce the multiple dimensional search space into a two-dimension search space and identify the appropriate negotiation strategies for the negotiating agents to form a payoff matrix which can be used for the game theory related stage of their interaction. The multiple stage negotiation process is introduced to improve the negotiation result. In this paper, an application which requires a large amount of computational resources to process the data generated from mobile devises is used to demonstrate that the proposed system is able to resolve the conflicts and obtain a valid solution.     

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

A survey on approaches to gridification

The Grid shows itself as a globally distributed computing environment, in which hardware and software resources are virtualized to transparently provide applications with vast capabilities. Just like the electrical power grid, the Grid aims at offering a powerful yet easy‐to‐use computing infrastructure to which applications can be easily ‘plugged’ and efficiently executed. Unfortunately, it is still very difficult to Grid‐enable applications, since current tools force users to take into account many details when adapting applications to run on the Grid. In this paper, we survey some of the recent efforts in providing tools for easy gridification of applications and propose several taxonomies to identify approaches followed in the materialization of such tools. We conclude this paper by describing common features among the proposed approaches, and by pointing out open issues and future directions in the research and development of gridification methods. Copyright © 2007 John Wiley & Sons, Ltd.     

计算几何与并行算法

本文首先介绍了计算几何的基本概念,论述了计算几何的四个基本问题,即几何搜索问题、相交问题、邻接问题及凸壳问题。然后重点分析了凸壳构造问题,介绍了其最佳串行算法、及相应的并行算法。接着对一些计算几何的串行及并行算法进行了分析比较。最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。